Resolving Ambiguity in Inter-chunk Dependency Parsing
نویسندگان
چکیده
Recently, dependency grammar has become quite popular in relatively free word-order languages. We encounter many structural ambiguities when parsing a sentence using dependency grammar. We use a chunking procedure to avoid constructing a mistaken dependency structure. Chunking reduces the scope of dependency relations between dependents and governors. This paper presents a method to resolve ambiguity in inter-chunk dependency parsing by using valency information, a structural preference rule and a statistical model. The proposed method is a combination of a rule-based approach and a statistical model. The structural preference rule is an important clue to resolve ambiguity and complements the valency information. The statistical method, using structural, semantic, and lexical information, is applied to resolve ambiguity when selecting the governor of adjuncts. Experimental results show that dependency parsing using this method resolves ambiguity in inter-chunk dependency parsing with 88.03 % accuracy.
منابع مشابه
Towards Building Parallel Dependency Treebanks: Intra-Chunk Expansion and Alignment for English Dependency Treebank
The paper presents our work on the annotation of intra-chunk dependencies on an English treebank that was previously annotated with Inter-chunk dependencies, and for which there exists a fully expanded parallel Hindi dependency treebank. This provides fully parsed dependency trees for the English treebank. We also report an analysis of the inter-annotator agreement for this chunk expansion task...
متن کاملTowards building a Kashmiri Treebank: Setting up the Annotation Pipeline
Kashmiri is a resource poor language with very less computational and language resources available for its text processing. As the main contribution of this paper, we present an initial version of the Kashmiri Dependency Treebank. The treebank consists of 1,000 sentences (17,462 tokens), annotated with part-of-speech (POS), chunk and dependency information. The treebank has been manually annota...
متن کاملA Three Stage Hybrid Parser for Hindi
The present paper describes a three stage technique to parse Hindi sentences. In the first stage we create a model with the features of head words of each chunk and their dependency relations. Here, the dependency relations are inter-chunk dependency relations. We have experimentally fixed a feature set for learning this model. In the second stage, we extract the intra-chunk dependency relation...
متن کاملIntra-Chunk Dependency Annotation : Expanding Hindi Inter-Chunk Annotated Treebank
We present two approaches (rule-based and statistical) for automatically annotating intra-chunk dependencies in Hindi. The intra-chunk dependencies are added to the dependency trees for Hindi which are already annotated with inter-chunk dependencies. Thus, the intra-chunk annotator finally provides a fully parsed dependency tree for a Hindi sentence. In this paper, we first describe the guideli...
متن کاملA Graph Based Method for Building Multilingual Weakly Supervised Dependency Parsers
The structure of a sentence can be seen as a spanning tree in a linguistically augmented graph of syntactic nodes. This paper presents an approach for unlabeled dependency parsing based on this view. The first step involves marking the chunks and the chunk heads of a given sentence and then identifying the intra-chunk dependency relations. The second step involves learning to identify the inter...
متن کامل